Eecient Public-key Cryptosystems Provably Secure against Active Adversaries
نویسندگان
چکیده
This paper proposes two new public-key cryptosystems semantically secure against adaptive chosen-ciphertext attacks. Inspired from a recently discovered trap-door technique based on composite-degree residues, our converted encryption schemes are proven, in the random oracle model, secure against active adversaries (NM-CCA2) under the assumptions that the Decision Composite Residuosity and Decision Partial Discrete Logarithms problems are intractable. We make use of speciic techniques that diier from Bellare-Rogaway or Fujisaki-Okamoto conversion methods. Our second scheme is speciically designed to be eecient for decryption and could provide an elegant alternative to OAEP.
منابع مشابه
Efficient Public-Key Cryptosystems Provably Secure Against Active Adversaries
This paper proposes two new public-key cryptosystems semantically secure against adaptive chosen-ciphertext attacks. Inspired from a recently discovered trapdoor technique based on composite-degree residues, our converted encryption schemes are proven, in the random oracle model, secure against active adversaries (IND-CCA2) under the assumptions that the Decision Composite Residuosity and Decis...
متن کاملAdaptively Secure Threshold Cryptography without the Assumption of Erasure
We exhibit eecient threshold cryptosystems which are secure against adaptive adversaries even when the players cannot erase their local data. Speciically, we present erasure-free adaptively-secure protocols for distributed decryption in Cramer-Shoup cryptosystem. Our techniques are also applicable for distributing the secret-key operation of other cryptosystems, like RSA, DSS, and ElGamal, as w...
متن کاملPublic-key Cryptosystems Provably Secure against Chosen Ciphertext Attacks
We show how to construct a public-key cryptosystem (as originally deened by Diie and Hellman) secure against chosen ciphertext attacks, given a public-key cryptosystem secure against passive eavesdropping and a non-interactive zero-knowledge proof system in the shared string model. No such secure cryptosystems were known before.
متن کاملImproved Public Key Cryptosystems Secure against Chosen Ciphertext Attacks
This note describes an improvement to the rst two of the three public key cryptosystems proposed by Zheng and Seberry, which are provably secure against chosen ciphertext attacks. The improvement removes a shortcoming with the original cryptosystems, which occurs when they are used for both con dentiality and sender authentication purposes.
متن کاملCircular Chosen-Ciphertext Security with Compact Ciphertexts
A key-dependent message (KDM) secure encryption scheme is secure even if an adversary obtains encryptions of messages that depend on the secret key. Such key-dependent encryptions naturally occur in scenarios such as harddisk encryption, formal cryptography, or in specific protocols. However, there are not many provably secure constructions of KDM-secure encryption schemes. Moreover, only one c...
متن کامل